The Knapsack Problem with Conflict Graphs
نویسندگان
چکیده
منابع مشابه
The Knapsack Problem with Conflict Graphs
We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond to the items of the knapsack problem. Similar conditions were treated in the literature for bin packing and scheduling problems. For the knaps...
متن کاملA New Optimization Model for the Sustainable Development: Quadratic Knapsack Problem with Conflict Graphs
New information technology constantly improves the efficiency of social networks. Using optimization and decision models in the context of large data sets attracts extensive attention. This paper investigates a novel mathematical model for designing and optimizing environmental economic policies in a protection zone. The proposed model is referred to as the quadratic knapsack problem with confl...
متن کاملBounds and Algorithms for the Knapsack Problem with Conflict Graph
We study the Knapsack Problem with Conflict Graph (KPCG), an extension of the 0-1 Knapsack Problem, in which a conflict graph describing incompatibilities between items is given. The goal of the KPCG is to select the maximum profit set of compatible items while satisfying the knapsack capacity constraint. We present a Branch-and-Bound approach to derive optimal solutions to the KPCG in short co...
متن کاملApproximation of knapsack problems with conflict and forcing graphs
We study the classical 0-1 knapsack problem with additional restrictions on pairs of items. A con ict constraint states that from a certain pair of items at most one item can be contained in a feasible solution. Reversing this condition, we obtain a forcing constraint stating that at least one of the two items must be included in the knapsack. A natural way for representing these constraints is...
متن کاملA Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
We study the Knapsack Problem with Conflict Graph (KPCG), an extension of the 0-1 Knapsack Problem, in which a conflict graph describing incompatibilities between items is given. The goal of the KPCG is to select the maximum profit set of compatible items while satisfying the knapsack capacity constraint. We present a new Branch-and-Bound approach to derive optimal solutions to the KPCG in shor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2009
ISSN: 1526-1719
DOI: 10.7155/jgaa.00186